A Stochastic Automata Model and its Algebraic Approach

نویسنده

  • Pedro R. D'Argenio
چکیده

We discuss a new model for the analysis and simulation of stochastic systems which we call stochastic automata. Basically, they are a combination of the timed automata model and generalised semi-Markov processes (GSMPs for short). We discuss their behaviour and we compare them to the GSMPs model. In addition, we deene a stochastic process algebra that supports general distribution (both continuous and discrete). Its semantics is given in terms of stochastic automata. We show that stochastic automata can be expressed in terms of the process algebra. We discuss a concrete example and we nish by discussing our current work on this topic and possible future directions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of a group in general fuzzy automata

 ‎Let $tilde{F}=(Q,S,tilde{R},Z,omega,tilde{delta},‎ F_1,F_2)$‎ ‎be a general fuzzy automaton and the set of its states be a group.‎ ‎The aim of this paper is the study of applications of a group in a‎ ‎general fuzzy automaton‎. ‎For this purpose‎, ‎we define the concepts‎ ‎of fuzzy normal kernel of a general fuzzy automaton‎, ‎fuzzy kernel‎ ‎of a general fuzzy automaton‎, ‎adjustable‎, ‎multip...

متن کامل

Pattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach

FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...

متن کامل

An Algebraic Approach to the Speci cation of Stochastic

We introduce a framework to study stochastic systems, i.e. systems in which the time of occurrence of activities is a general random variable. We introduce and discuss in depth a stochastic process algebra (named) adequate to specify and analyse those systems. In order to give semantics to , we also introduce a model that is an extension of traditional automata with clocks which are basically r...

متن کامل

An Algebraic Approach to theSpeci cation

We introduce a framework to study stochastic systems, i.e. systems in which the time of occurrence of activities is a general random variable. We introduce and discuss in depth a stochastic process algebra (named) adequate to specify and analyse those systems. In order to give semantics to , we also introduce a model that is an extension of traditional automata with clocks which are basically r...

متن کامل

Links between multiplicity automata, observable operator models and predictive state representations: a unified learning framework

Stochastic multiplicity automata (SMA) are weighted finite automata that generalize probabilistic automata. They have been used in the context of probabilistic grammatical inference. Observable operator models (OOMs) are a generalization of hidden Markov models, which in turn are models for discrete-valued stochastic processes and are used ubiquitously in the context of speech recognition and b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995